Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center
نویسندگان
چکیده
منابع مشابه
Clustering-based Nearest Neighbor Searching
This paper proposes a Clustering-based Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigid-grid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution, with help of a progressive-styled clustering operation. The grids produced in this way adapt to data natural...
متن کاملA New Shared Nearest Neighbor Clustering Algorithm and its Applications
Clustering depends critically on density and distance (similarity), but these concepts become increasingly more difficult to define as dimensionality increases. In this paper we offer definitions of density and similarity that work well for high dimensional data (actually, for data of any dimensionality). In particular, we use a similarity measure that is based on the number of neighbors that t...
متن کاملBatch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets
Incremental data mining algorithms process frequent updates to dynamic datasets efficiently by avoiding redundant computation. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremental algorithm to overcome both these bottlenecks by efficiently ...
متن کاملClustering Microarray Data based on Density and Shared Nearest Neighbor Measure
Microarray technology is being used to study several genes at a time generating huge amounts of data. Managing and extracting useful information from such data is a big challenge for the bioinformatics community. Clustering is an important data mining technique that has been proved to be useful for the analysis and understanding of such data. Clustering is used to automatically identify similar...
متن کاملAdaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional space. To solve this problem, many adaptive nearest neighbor classifiers were proposed. In this paper, a locally adaptive nearest neighbor classification method based on supervised learning style which works well for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12122014